Hierarchy of players in swap robust voting games
نویسندگان
چکیده
Ordinarily, the process of decision making by a committee through voting is modelled by a monotonic game the range of whose characteristic function is restricted to f0; 1g: The decision rule that governs the collective action of a voting body induces a hierarchy in the set of players in terms of the a-priori inuence that the players have over the decision making process. In order to determine this hierarchy in a swap robust game, one has to either evaluate a number-based power index (e.g., the Shapley-Shubik index, the Banzhaf-Coleman index) for each player or conduct a pairwise comparison between players in order to nd out whether there exists a coalition in which player i is desirable over another player j as a coalition partner. In this paper we outline a much simpler and more elegant mechanism to determine the ranking of players in terms of their a-priori power using only minimal winning coalitions, rather than the entire set of winning coalitions. Keywords Simple game, Swap robust game, Desirability, Weak desirability, Lexicographic ordering. JEL classi cation C71, D71 Email: [email protected] yEmail: [email protected]
منابع مشابه
Some Advances in the Theory of Voting Systems Based on Experimental Algorithms
In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent structures there is an important problem that consists in determining the weightedness of a voting system by means of trades among voters in sets of coalitions. The fundamental theorem by Taylor and Zwicker [8] establishes the equivalence between weighted voting games and k-trade robust games for each ...
متن کاملFrom Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
In this thesis we study computational aspects of different voting problems and cooperative games with hedonic preferences. For two well-studied voting systems, namely Bucklin and fallback voting, we present a detailed study of the computational complexity of common manipulative attacks on elections. We fully describe the classical worst-case complexity of manipulation, bribery, and swap bribery...
متن کاملA note on the ordinal equivalence of power indices in games with coalition structure
The desirability relation was introduced by Isbell (1958) to qualitatively compare the a priori influence of voters in a simple game. In this paper, we extend this desirability relation to simple games with coalition structure. In these games, players organize themselves into a priori disjoint coalitions. It appears that the desirability relation defined in this paper is a complete preorder in ...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملFalse-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
False-name manipulation refers to the question of whether a player in a weighted voting game can increase her power by splitting into several players and distributing her weight among these false identities. Analogously to this splitting problem, the beneficial merging problem asks whether a coalition of players can increase their power in a weighted voting game by merging their weights. Aziz e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Social Choice and Welfare
دوره 38 شماره
صفحات -
تاریخ انتشار 2012